A Scalable Many-Objective Pathfinding Benchmark Suite
نویسندگان
چکیده
Route planning also known as pathfinding is one of the key elements in logistics, mobile robotics and other applications, where engineers face many conflicting objectives. However, most current route algorithms consider only up to three In this paper, we propose a scalable many-objective benchmark problem covering important features for routing applications based on real-world data. We define five objective functions representing distance, traveling time, delays caused by accidents, two specific such curvature elevation. analyse several different instances test provide their true Pareto-front difficulties. apply well-known evolutionary multi-objective algorithms. Since can be easily transferred problems, construct from OpenStreetMap evaluate optimisation observe that are able promising results application. The proposed represents enabling researchers approaches.
منابع مشابه
Radar Waveform Optimisation as a Many-Objective Application Benchmark
This paper introduces a real, unmodified Many-Objective optimisation problem for use in optimisation algorithm benchmarking. The radar waveform design problem has 9 objectives and an integer decision space that can be scaled from 4 to 12 decision variables. Proprietary radar waveform design software has been encapsulated in a fast and portable form to facilitate research groups in studying high...
متن کاملHighly Scalable Multi Objective Test Suite Minimisation Using Graphics Cards
Despite claims of “embarrassing parallelism” for many optimisation algorithms, there has been very little work on exploiting parallelism as a route for SBSE scalability. This is an important oversight because scalability is so often a critical success factor for Software Engineering work. This paper shows how relatively inexpensive General Purpose computing on Graphical Processing Units (GPGPU)...
متن کاملThe GAP Benchmark Suite
We present a graph processing benchmark suite with the goal of helping to standardize graph processing evaluations. Fewer differences between graph processing evaluations will make it easier to compare different research efforts and quantify improvements. The benchmark not only specifies graph kernels, input graphs, and evaluation methodologies, but it also provides optimized baseline implement...
متن کاملThe GemsTD benchmark suite
We introduce version 1.0 of the GemsTD benchmark suite and report the performance on several different architectures for the cases in this suite. TRITA-PDC-2003:2 • ISSN 1401-2731 • ISRN KTH/PDC/R--03/2--SE
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2022
ISSN: ['1941-0026', '1089-778X']
DOI: https://doi.org/10.1109/tevc.2021.3089050